Methods and apparatus for CRC concatenated polar encoding

ABSTRACT

Certain aspects of the present disclosure generally relate to techniques for encoding and decoding bits of information using cyclic redundancy check (CRC) concatenated polar encoding and decoding. The CRC concatenated polar encoding techniques may avoid transmission of dummy bits. A method generally includes obtaining the bits of information to be transmitted. The method includes performing CRC outer encoding of the bits of information using an even-weighted generator polynomial to produce CRC encoded bits. The method includes performing polar inner encoding of the CRC encoded bits to generate a codeword. The method includes discarding a first code bit at a beginning of the codeword. The shortened codeword is transmitted over a wireless medium. In another method, bit-level scrambling is performed on the CRC encoded bits before the polar encoding to avoid generating a dummy bit. In another method, only odd-weighted generator polynomials are selected to avoid generating the dummy bit.

CROSS-REFERENCE TO RELATED APPLICATION & PRIORITY CLAIM

This application is a national stage application under 35 U.S.C. 371 ofPCT/CN2018/107129, filed Sep. 21, 2018, which claims the benefit of andpriority to PCT Application No. PCT/CN2017/109694, filed Nov. 7, 2017,herein incorporated by reference in their entireties as if fully setforth below and for all applicable purposes.

INTRODUCTION Field of the Disclosure

Certain aspects of the present disclosure generally relate to encodingbits of information and, more particularly, to methods and apparatus forcyclic redundancy check (CRC) concatenated polar encoding.

Description of Related Art

Wireless communication systems are widely deployed to provide varioustelecommunication services such as telephony, video, data, messaging,broadcasts, etc. These wireless communication systems may employmultiple-access technologies capable of supporting communication withmultiple users by sharing available system resources (e.g., bandwidth,transmit power, etc.). Examples of such multiple-access systems include3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE)systems, LTE Advanced (LTE-A) systems, code division multiple access(CDMA) systems, time division multiple access (TDMA) systems, frequencydivision multiple access (FDMA) systems, orthogonal frequency divisionmultiple access (OFDMA) systems, single-carrier frequency divisionmultiple access (SC-FDMA) systems, and time division synchronous codedivision multiple access (TD-SCDMA) systems, to name a few.

In some examples, a wireless multiple-access communication system mayinclude a number of base stations (BSs), which are each capable ofsimultaneously supporting communication for multiple communicationdevices, otherwise known as user equipments (UEs). In an LTE or LTE-Anetwork, a set of one or more base stations may define an eNodeB (eNB).In other examples (e.g., in a next generation, a new radio (NR), or 5Gnetwork), a wireless multiple access communication system may include anumber of distributed units (DUs) (e.g., edge units (EUs), edge nodes(ENs), radio heads (RHs), smart radio heads (SRHs), transmissionreception points (TRPs), etc.) in communication with a number of centralunits (CUs) (e.g., central nodes (CNs), access node controllers (ANCs),etc.), where a set of one or more DUs, in communication with a CU, maydefine an access node (e.g., which may be referred to as a BS, 5G NB,next generation NodeB (gNB or gNodeB), transmission reception point(TRP), etc.). A BS or DU may communicate with a set of UEs on downlinkchannels (e.g., for transmissions from a BS or DU to a UE) and uplinkchannels (e.g., for transmissions from a UE to BS or DU).

These multiple access technologies have been adopted in varioustelecommunication standards to provide a common protocol that enablesdifferent wireless devices to communicate on a municipal, national,regional, and even global level. NR (e.g., new radio or 5G) is anexample of an emerging telecommunication standard. NR is a set ofenhancements to the LTE mobile standard promulgated by 3GPP. NR isdesigned to better support mobile broadband Internet access by improvingspectral efficiency, lowering costs, improving services, making use ofnew spectrum, and better integrating with other open standards usingOFDMA with a cyclic prefix (CP) on the downlink (DL) and on the uplink(UL). To these ends, NR supports beamforming, multiple-inputmultiple-output (MIMO) antenna technology, and carrier aggregation.

Additionally, NR is expected to introduce new encoding and decodingschemes that improve transmission and reception of data. For example,Polar codes are currently being considered as a candidate forerror-correction in next-generation wireless systems such as NR. Polarcodes are a relatively recent breakthrough in coding theory, which havebeen proven to asymptotically (for code size N approaching infinity)achieve the Shannon capacity. However, while Polar codes perform well atlarge values of N, for lower values of N, polar codes suffer from poorminimum distance, leading to the development of techniques such assuccessive cancellation list (SCL) decoding, which leverage a simpleouter code having excellent minimum distance, such as a CRC orparity-check, on top of a polar inner code, such that the combined codehas excellent minimum distance.

However, as the demand for mobile broadband access continues toincrease, there exists a need for further improvements in NR and LTEtechnology. Preferably, these improvements should be applicable to othermulti-access technologies and the telecommunication standards thatemploy these technologies.

BRIEF SUMMARY

The systems, methods, and devices of the disclosure each have severalaspects, no single one of which is solely responsible for its desirableattributes. Without limiting the scope of this disclosure as expressedby the claims which follow, some features will now be discussed briefly.After considering this discussion, and particularly after reading thesection entitled “Detailed Description” one will understand how thefeatures of this disclosure provide advantages that include improvedcommunications between access points and stations in a wireless network.

To the accomplishment of the foregoing and related ends, the one or moreaspects comprise the features hereinafter fully described andparticularly pointed out in the claims. The following description andthe appended drawings set forth in detail certain illustrative featuresof the one or more aspects. These features are indicative, however, ofbut a few of the various ways in which the principles of various aspectsmay be employed.

The following summarizes some aspects of the present disclosure toprovide a basic understanding of the discussed technology. This summaryis not an extensive overview of all contemplated features of thedisclosure, and is intended neither to identify key or critical elementsof all aspects of the disclosure nor to delineate the scope of any orall aspects of the disclosure. Its sole purpose is to present someconcepts of one or more aspects of the disclosure in summary form as aprelude to the more detailed description that is presented later.

Certain aspects of the present disclosure provide an apparatus forwireless communications. The apparatus generally includes at least oneprocessor coupled with a memory and comprising at least one encodercircuit. The at least one encoder circuit is configured to obtain bitsof information to be transmitted. The at least one encoder circuit isconfigured to perform cyclic redundancy check (CRC) outer encoding ofthe bits of information using an even-weighted generator polynomial toproduce CRC encoded bits. The at least one encoder circuit is configuredto perform polar inner encoding of the CRC encoded bits to generate acodeword. The at least one encoder circuit is configured to discard afirst code bit at a beginning of the codeword to produce a shortenedcodeword. The apparatus includes a transmitter configured to transmitthe shortened codeword in accordance with a wireless technology across achannel via one or more antenna elements situated proximate thetransmitter.

Certain aspects of the present disclosure provide another apparatus forwireless communications. The apparatus generally includes at least oneprocessor coupled with a memory and comprising at least one encodercircuit. The at least one encoder circuit is configured to obtain bitsof information to be transmitted. The at least one encoder circuit isconfigured to perform CRC outer encoding of the bits of informationusing an even-weighted generator polynomial to produce CRC encoded bits.The at least one encoder circuit is configured to perform bit scramblingof the CRC encoded bits. The at least one encoder circuit is configuredto perform polar inner encoding of the scrambled CRC encoded bits togenerate a codeword. The apparatus includes a transmitter configured totransmit the codeword in accordance with a wireless technology across achannel via one or more antenna elements situated proximate thetransmitter.

Certain aspects of the present disclosure provide another apparatus forwireless communications. The apparatus generally includes at least oneprocessor coupled with a memory and comprising at least one encodercircuit. The at least one encoder circuit is configured to obtain bitsof information to be transmitted. The at least one encoder circuit isconfigured to select only odd-weighted generator polynomials forperforming CRC outer encoding of the bits of information to produce CRCencoded bits. The at least one encoder circuit is configured to performpolar inner encoding of the CRC encoded bits to generate a codeword. Theapparatus includes a transmitter configured to transmit the codeword inaccordance with a wireless technology across a channel via one or moreantenna elements situated proximate the transmitter.

Certain aspects of the present disclosure provide a method for encodingbits of information. The method generally includes obtaining the bits ofinformation to be transmitted. The method includes performing CRC outerencoding of the bits of information using an even-weighted generatorpolynomial to produce CRC encoded bits. The method includes performingpolar inner encoding of the CRC encoded bits to generate a codeword. Themethod includes discarding a first code bit at a beginning of thecodeword to produce a shortened codeword. The method includestransmitting the shortened codeword in accordance with a wirelesstechnology across a channel via one or more antenna elements situatedproximate a transmitter

Certain aspects of the present disclosure provide another method forencoding bits of information. The method generally includes obtainingthe bits of information to be transmitted. The method includesperforming CRC outer encoding of the bits of information using aneven-weighted generator polynomial to produce CRC encoded bits. Themethod includes performing bit scrambling of the CRC encoded bits. Themethod includes performing polar inner encoding of the scrambled CRCencoded bits to generate a codeword. The method includes transmittingthe codeword in accordance with a wireless technology across a channelvia one or more antenna elements situated proximate a transmitter.

Certain aspects of the present disclosure provide another method forencoding bits of information. The method generally includes obtainingthe bits of information to be transmitted. The method includes selectingonly odd-weighted generator polynomials for performing CRC outerencoding of the bits of information to produce CRC encoded bits. Themethod includes performing polar inner encoding of the CRC encoded bitsto generate a codeword. The method includes transmitting the codeword inaccordance with a wireless technology across a channel via one or moreantenna elements situated proximate a transmitter.

Certain aspects of the present disclosure provide an apparatus forwireless communications. The apparatus generally includes means forobtaining bits of information to be transmitted. The apparatus includesmeans for performing CRC outer encoding of the bits of information usingan even-weighted generator polynomial to produce CRC encoded bits. Theapparatus includes means for performing polar inner encoding of the CRCencoded bits to generate a codeword. The apparatus includes means fordiscarding a first code bit at a beginning of the codeword to produce ashortened codeword. The apparatus includes means for transmitting theshortened codeword in accordance with a wireless technology across achannel via one or more antenna elements situated proximate atransmitter

Certain aspects of the present disclosure provide another apparatus forwireless communications. The apparatus generally includes means forobtaining bits of information to be transmitted. The apparatus includesmeans for performing CRC outer encoding of the bits of information usingan even-weighted generator polynomial to produce CRC encoded bits. Theapparatus includes means for performing bit scrambling of the CRCencoded bits. The apparatus includes means for performing polar innerencoding of the scrambled CRC encoded bits to generate a codeword. Theapparatus includes means for transmitting the codeword in accordancewith a wireless technology across a channel via one or more antennaelements situated proximate a transmitter.

Certain aspects of the present disclosure provide another apparatus forwireless communications. The apparatus generally includes means forobtaining bits of information to be transmitted. The apparatus includesmeans for selecting only odd-weighted generator polynomials forperforming CRC outer encoding of the bits of information to produce CRCencoded bits. The apparatus includes means for performing polar innerencoding of the CRC encoded bits to generate a codeword. The apparatusincludes means for transmitting the codeword in accordance with awireless technology across a channel via one or more antenna elementssituated proximate a transmitter.

Certain aspects of the present disclosure provide a computer readablemedium having computer executable code stored thereon for wirelesscommunications. The computer readable medium generally includes code forobtaining bits of information to be transmitted. The computer readablemedium includes code for performing CRC outer encoding of the bits ofinformation using an even-weighted generator polynomial to produce CRCencoded bits. The computer readable medium includes code for performingpolar inner encoding of the CRC encoded bits to generate a codeword. Thecomputer readable medium includes code for discarding a first code bitat a beginning of the codeword to produce a shortened codeword. Thecomputer readable medium includes code for transmitting the shortenedcodeword in accordance with a wireless technology across a channel viaone or more antenna elements situated proximate a transmitter

Certain aspects of the present disclosure provide a computer readablemedium having computer executable code stored thereon for wirelesscommunications. The computer readable medium generally includes code forobtaining bits of information to be transmitted. The computer readablemedium includes code for performing CRC outer encoding of the bits ofinformation using an even-weighted generator polynomial to produce CRCencoded bits. The computer readable medium includes code for performingbit scrambling of the CRC encoded bits. The computer readable mediumincludes code for performing polar inner encoding of the scrambled CRCencoded bits to generate a codeword. The computer readable mediumincludes code for transmitting the codeword in accordance with awireless technology across a channel via one or more antenna elementssituated proximate a transmitter.

Certain aspects of the present disclosure provide a computer readablemedium having computer executable code stored thereon for wirelesscommunications. The computer readable medium generally includes code forobtaining bits of information to be transmitted. The computer readablemedium includes code for selecting only odd-weighted generatorpolynomials for performing CRC outer encoding of the bits of informationto produce CRC encoded bits. The computer readable medium includes codefor performing polar inner encoding of the CRC encoded bits to generatea codeword. The computer readable medium includes code for transmittingthe codeword in accordance with a wireless technology across a channelvia one or more antenna elements situated proximate a transmitter.

The techniques may be embodied in methods, apparatuses, and computerprogram products. Other aspects, features, and embodiments of thepresent invention will become apparent to those of ordinary skill in theart, upon reviewing the following description of specific, exemplaryembodiments of the present invention in conjunction with theaccompanying figures. While features of the present invention may bediscussed relative to certain embodiments and figures below, allembodiments of the present invention can include one or more of theadvantageous features discussed herein. In other words, while one ormore embodiments may be discussed as having certain advantageousfeatures, one or more of such features may also be used in accordancewith the various embodiments of the invention discussed herein. Insimilar fashion, while exemplary embodiments may be discussed below asdevice, system, or method embodiments it should be understood that suchexemplary embodiments can be implemented in various devices, systems,and methods.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above-recited features of the presentdisclosure can be understood in detail, a more particular description,briefly summarized above, may be had by reference to aspects, some ofwhich are illustrated in the drawings. It is to be noted, however, thatthe appended drawings illustrate only certain typical aspects of thisdisclosure and are therefore not to be considered limiting of its scope,for the description may admit to other equally effective aspects.

FIG. 1 is a block diagram conceptually illustrating an exampletelecommunications system, in accordance with certain aspects of thepresent disclosure.

FIG. 2 is a block diagram illustrating an example logical architectureof a distributed radio access network (RAN), in accordance with certainaspects of the present disclosure.

FIG. 3 is a diagram illustrating an example physical architecture of adistributed RAN, in accordance with certain aspects of the presentdisclosure.

FIG. 4 is a block diagram conceptually illustrating a design of anexample base station (BS) and user equipment (UE), in accordance withcertain aspects of the present disclosure.

FIG. 5 is a diagram showing examples for implementing a communicationprotocol stack, in accordance with certain aspects of the presentdisclosure.

FIG. 6 illustrates an example of a frame format for a new radio (NR)system, in accordance with certain aspects of the present disclosure.

FIG. 7 is a block diagram illustrating an encoder, in accordance withcertain aspects of the present disclosure.

FIG. 8 is a block diagram illustrating a decoder, in accordance withcertain aspects of the present disclosure.

FIG. 9 is a block diagram illustrating a cyclic redundancy check (CRC)concatenated polar encoder, in accordance with certain aspects of thepresent disclosure.

FIG. 10 is a block diagram illustrating a CRC concatenated polardecoder, in accordance with certain aspects of the present disclosure.

FIG. 11 illustrates example operations for CRC concatenated polarencoding bits of information including discarding a dummy bit, inaccordance with certain aspects of the present disclosure.

FIG. 12 is a block diagram illustrating a CRC concatenated polar encoderthat discards a dummy, in accordance with certain aspects of the presentdisclosure.

FIG. 13 illustrates example operations for CRC concatenated polarencoding bits of information including performing bit-level scramblingof CRC encoded bits, in accordance with certain aspects of the presentdisclosure.

FIG. 14 is a block diagram illustrating a CRC concatenated polar encoderthat performs bit level scrambling of the CRC output, in accordance withcurtain aspects of the present disclosure.

FIG. 15 illustrates example operations for CRC concatenated polarencoding bits of information using only odd-weighted CRC generatorpolynomials, in accordance with certain aspects of the presentdisclosure.

FIG. 16 is a block diagram illustrating a CRC concatenated polar encoderusing only odd-weighted CRC generator polynomials, in accordance withcertain aspects of the present disclosure.

FIG. 17 is an example graph illustrating encoding performance of variousCRC generator polynomials

FIG. 18 illustrates a communications device that may include variouscomponents configured to perform operations for the techniques disclosedherein, in accordance with aspects of the present disclosure.

To facilitate understanding, identical reference numerals have beenused, where possible, to designate identical elements that are common tothe figures. It is contemplated that elements disclosed in one aspectmay be beneficially utilized on other aspects without specificrecitation.

DETAILED DESCRIPTION

Aspects of the present disclosure provide apparatus, methods, processingsystems, and computer readable mediums for encoding/decoding, and moreparticularly to encoding and decoding using cyclic redundancy check(CRC) concatenated polar codes.

The following description provides examples, and is not limiting of thescope, applicability, or examples set forth in the claims. Changes maybe made in the function and arrangement of elements discussed withoutdeparting from the scope of the disclosure. Various examples may omit,substitute, or add various procedures or components as appropriate. Forinstance, the methods described may be performed in an order differentfrom that described, and various steps may be added, omitted, orcombined. Also, features described with respect to some examples may becombined in some other examples. For example, an apparatus may beimplemented or a method may be practiced using any number of the aspectsset forth herein. In addition, the scope of the disclosure is intendedto cover such an apparatus or method which is practiced using otherstructure, functionality, or structure and functionality in addition to,or other than, the various aspects of the disclosure set forth herein.It should be understood that any aspect of the disclosure disclosed,herein may be embodied by one or more elements of a claim. The word“exemplary” is used herein to mean “serving as an example, instance, orillustration.” Any aspect described herein as “exemplary” is notnecessarily to be construed as preferred or advantageous over otheraspects.

The techniques described herein may be used for various wirelesscommunication technologies, such as LTE, CDMA, TDMA, FDMA, OFDMA,SC-FDMA and other networks. The terms “network” and “system” are oftenused interchangeably. A CDMA network may implement a radio technologysuch as universal terrestrial radio access (UTRA), cdma2000, etc. UTRAincludes wideband CDMA (WCDMA) and other variants of CDMA. cdma2000covers IS-2000, IS-95 and IS-856 standards. A TDMA network may implementa radio technology such as global system for mobile communications(GSM). An OFDMA network may implement a radio technology such as NR(e.g. 5G RA), evolved UTRA (E-UTRA), ultra mobile broadband (UMB), IEEE802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDMA, etc. UTRAand E-UTRA are part of universal mobile telecommunication system (UMTS).

New Radio (NR) is an emerging wireless communications technology underdevelopment in conjunction with the 5G Technology Forum (5GTF). 3GPPLong Term Evolution (LTE) and LTE-Advanced (LTE-A) are releases of UMTSthat use E-UTRA. UTRA, E-UTRA, UMTS, LTE, LTE-A and GSM are described indocuments from an organization named “3rd Generation PartnershipProject” (3GPP). cdma2000 and UMB are described in documents from anorganization named “3rd Generation Partnership Project 2” (3GPP2). Thetechniques described herein may be used for the wireless networks andradio technologies mentioned above as well as other wireless networksand radio technologies. For clarity, while aspects may be describedherein using terminology commonly associated with 3G and/or 4G wirelesstechnologies, aspects of the present disclosure can be applied In othergeneration-based communication systems, such as 5G and later, includingNR technologies.

New radio (NR) access (e.g., 5G technology) may support various wirelesscommunication services, such as enhanced mobile broadband (eMBB)targeting wide bandwidth (e.g., 80 MHz or beyond), millimeter wave (mmW)targeting high carrier frequency (e.g., 25 GHz or beyond), massivemachine type communications MTC (mMTC) targeting non-backward compatibleMTC techniques, and/or mission critical targeting ultra-reliablelow-latency communications (URLLC). These services may include latencyand reliability requirements. These services may also have differenttransmission time intervals (TTI) to meet respective quality of service(QoS) requirements. In addition, these services may co-exist in the samesubframe.

Example Wireless Communications System

FIG. 1 illustrates an example wireless communication network 100 inwhich aspects of the present disclosure may be performed. For example,the wireless communication network 100 may be a New Radio (NR) or 5Gnetwork. A transmitting device in the wireless communication network100, such as a UE 120 on the uplink or a BS 110 on the downlink, may beconfigured to cyclic redundancy check (CRC) polar encoding. If thetransmitting device uses an even-weighted CRC generator polynomial, thenthe resulting CRC codeword is also even-weighted, leading to a cascadedpolar output in which the first bit is a dummy bit, independent to themessage. Accordingly, the transmitting device may avoid transmission ofthe dummy bit by using only odd-weighted CRC generator polynomials,dropping the first bit, or applying bit level scrambling to the CRCoutput before the polar encoding.

As illustrated in FIG. 1, the wireless communication network 100 mayinclude a number of base stations (BSs) 110 and other network entities.A BS may be a station that communicates with user equipments (UEs). EachBS 110 may provide communication coverage for a particular geographicarea. In 3GPP, the term “cell” can refer to a coverage area of a Node B(NB) and/or a NB subsystem serving this coverage area, depending on thecontext in which the term is used. In NR systems, the term “cell” andnext generation NodeB (gNB or gNodeB), NR BS, 5G NB, access point (AP),or transmission reception point (TRP) may be interchangeable. In someexamples, a cell may not necessarily be stationary, and the geographicarea of the cell may move according to the location of a mobile BS. Insome examples, the base stations may be interconnected to one anotherand/or to one or more other base stations or network nodes (not shown)in wireless communication network 100 through various types of backhaulinterfaces, such as a direct physical connection, a wireless connection,a virtual network, or the like using any suitable transport network.

In general, any number of wireless networks may be deployed in a givengeographic area. Each wireless network may support a particular radioaccess technology (RAT) and may operate on one or more frequencies. ARAT may also be referred to as a radio technology, an air interface,etc. A frequency may also be referred to as a carrier, a subcarrier, afrequency channel, a tone, a subband, etc. Each frequency may support asingle RAT in a given geographic area in order to avoid interferencebetween wireless networks of different RATs. In some cases, NR or 5G RATnetworks may be deployed.

A BS may provide communication coverage for a macro cell, a pico cell, afemto cell, and/or other types of cells. A macro cell may cover arelatively large geographic area (e.g., several kilometers in radius)and may allow unrestricted access by UEs with service subscription. Apico cell may cover a relatively small geographic area and may allowunrestricted access by UEs with service subscription. A femto cell maycover a relatively small geographic area (e.g., a home) and may allowrestricted access by UEs having an association with the femto cell(e.g., UEs in a Closed Subscriber Group (CSG), UEs for users in thehome, etc.). A BS for a macro cell may be referred to as a macro BS, ABS for a pico cell may be referred to as a pico BS. A BS for a femtocell may be referred to as a femto BS or a home BS. In the example shownin FIG. 1, the BSs 110 a, 110 b and 110 c may be macro BSs for the macrocells 102 a, 102 b and 102 c, respectively. The BS 110 x may be a picoBS for a pica cell 102 x. The BSs 110 y and 110 z may be femto BSs forthe femto cells 102 y and 102 z, respectively. A BS may support one ormultiple (e.g., three) cells.

Wireless communication network 100 may also include relay stations. Arelay station is a station that receives a transmission of data and/orother information from an upstream station (e.g., a BS or a UE) andsends a transmission of the data and/or other information to adownstream station a UE or a BS). A relay station may also be a UE thatrelays transmissions for other UEs. In the example shown in FIG. 1, arelay station 110 r may communicate with the BS 110 a and a UE 120 r inorder to facilitate communication between the BS 110 a and the UE 120 r.A relay station may also be referred to as a relay BS, a relay, etc.

Wireless communication network 100 may be a heterogeneous network thatincludes BSs of different types, e.g., macro BS, pico BS, femto BS,relays, etc. These different types of BSs may have different transmitpower levels, different coverage areas, and different impact oninterference in the wireless communication network 100. For example,macro BS may have a high transmit power level (e.g., 20 Watts) whereaspico BS, femto BS, and relays may have a lower transmit power level(e.g., 1 Watt).

Wireless communication network 100 may support synchronous orasynchronous operation. For synchronous operation, the BSs may havesimilar frame timing, and transmissions from different BSs may beapproximately aligned in time. For asynchronous operation, the BSs mayhave different frame timing, and transmissions from different BSs maynot be aligned in time. The techniques described herein may be used forboth synchronous and asynchronous operation.

A network controller 130 may couple to a set of BSs and providecoordination and control for these BSs. The network controller 130 maycommunicate with the BSs 110 via a backhaul. The BSs 110 may alsocommunicate with one another (e.g., directly or indirectly) via wirelessor wireline backhaul.

The UEs 120 (e.g., 120 x, 120 y, etc.) may be dispersed throughout thewireless communication network 100, and each UE may be stationary ormobile. A UE may also be referred to as a mobile station, a terminal, anaccess terminal, a subscriber unit, a station, a Customer PremisesEquipment (CPE), a cellular phone, a smart phone, a personal digitalassistant (PDA), a wireless modem, a wireless communication device, ahandheld device, a laptop computer, a cordless phone, a wireless localloop (WLL) station, a tablet computer, a camera, a gaining device, anetbook, a smartbook, an ultrabook, an appliance, a medical device ormedical equipment, a biometric sensor/device, a wearable device such asa smart watch, smart clothing, smart glasses, a smart wrist hand, smartjewelry (e.g., a smart ring, a smart bracelet, etc.), an entertainmentdevice (e.g., a music device, a video device, a satellite radio, etc.),a vehicular component or sensor, a smart meter/sensor, industrialmanufacturing equipment, a global positioning system device, or anyother suitable device that is configured to communicate via a wirelessor wired medium. Some UEs may be considered machine-type communication(MTC) devices or evolved MTC (eMTC) devices. MTC and eMTC UEs include,for example, robots, drones, remote devices, sensors, meters, monitors,location tags, etc., that may communicate with a BS, another device(e.g., remote device), or some other entity. A wireless node mayprovide, for example, connectivity for or to a network (e.g., a widearea network such as Internet or a cellular network) via a wired orwireless communication link. Some UEs may be consideredInternet-of-Things (IoT) devices, which may be narrowband IoT (NB-IoT)devices.

Certain wireless networks (e.g., LTE) utilize orthogonal frequencydivision multiplexing (OFDM) on the downlink and single-carrierfrequency division multiplexing (SC-FDM) on the uplink. OFDM and SC-FDMpartition the system bandwidth into multiple (K) orthogonal subcarriers,which are also commonly referred to as tones, bins, etc. Each subcarriermay be modulated with data. In general, modulation symbols are sent inthe frequency domain with OFDM and in the time domain with SC-FDM. Thespacing between adjacent subcarriers may be fixed, and the total numberof subcarriers (K) may be dependent on the system bandwidth. Forexample, the spacing of the subcarriers may be 15 kHz and the minimumresource allocation (called a “resource block” (RB)) may be 12subcarriers (or 180 kHz). Consequently, the nominal Fast FourierTransfer (FFT) size may be equal to 128, 256, 512, 1024 or 2048 forsystem bandwidth of 1.25, 2.5, 5, 10, or 20 megahertz (MHz),respectively. The system bandwidth may also be partitioned intosubbands. For example, a subband may cover 1.08 MHz (i.e., 6 resourceblocks), and there may be 1, 2, 4, 8, or 16 subbands for systembandwidth of 1.25, 10 or 20 MHz, respectively.

While aspects of the examples described herein may be associated withLTE technologies, aspects of the present disclosure may be applicablewith other wireless communications systems, such as NR. NR may utilizeOFDM with a CP on the uplink and downlink and include support forhalf-duplex operation using TDD. Beamforming may be supported and beamdirection may be dynamically configured. MIMO transmissions withprecoding may also be supported. MIMO configurations in the DL maysupport up to 8 transmit antennas with multi-layer DL transmissions upto 8 streams and up to 2 streams per UE. Multi-layer transmissions withup to 2 streams per UE may be supported. Aggregation of multiple cellsmay be supported with up to 8 serving cells.

In some examples, access to the air interface may be scheduled. Ascheduling entity (e.g., a BS) allocates resources for communicationamong some or all devices and equipment within its service area or cell,the scheduling entity may be responsible for scheduling, assigning,reconfiguring, and releasing resources for one or more subordinateentities. That is, for scheduled communication, subordinate entitiesutilize resources allocated by the scheduling entity. Base stations arenot the only entities that may function as a scheduling entity, in someexamples, a UE may function as a scheduling entity and may scheduleresources for one or more subordinate entities (e.g., one or more otherUEs), and the other UEs may utilize the resources scheduled by the UEfor wireless communication. In some examples, A UE may function as ascheduling entity in a peer-to-peer (P2P) network, and/or in a meshnetwork. In a mesh network example, UEs may communicate directly withone another in addition to communicating with scheduling entity.

In FIG. 1, a solid line with double arrows indicates desiredtransmissions between a UE and a serving BS, which is a BS designated toserve the UE on the downlink and/or uplink. A finely dashed line withdouble arrows indicates interfering transmissions between a UE and a BS.

FIG. 2 illustrates an example logical architecture of a distributedradio access network (RAN) 200, which may be implemented in the wirelesscommunication network 100 illustrated in FIG. 1. A 5G access node 206may include an access node controller (ANC) 202. ANC 202 may be acentral unit (CU) of the distributed RAN 200. The backhaul interface tothe next generation core network (NG-CN) 204 may terminate at ANC 202.The backhaul interface to neighboring next generation access nodes(NG-ANs) 210 may terminate at ANC 202. ANC 202 may include one or moreTRPs 208 (e.g., cells, BSs, gNBs, etc.).

The TRPs 208 may be a distributed unit (DU). TRPs 208 may be connectedto a single ANC (e.g., ANC 202) or more than one ANC (not illustrated).For example, for RAN sharing, radio as a service (RaaS), and servicespecific AND deployments, TRPs 208 may be connected to more than oneANC. TRPs 208 may each include one or more antenna ports. TRPs 208 maybe configured to individually (e.g., dynamic selection) or jointly(e.g., joint transmission) serve traffic to a UE.

The logical architecture of distributed RAN 200 may support fronthaulingsolutions across different deployment types. For example, the logicalarchitecture may be based on transmit network capabilities (e.g.,bandwidth, latency, and/or jitter).

The logical architecture of distributed RAN 200 may share featuresand/or components with LTE. For example, next generation access node(NG-AN) 210 may support dual connectivity with NR and may share a commonfronthaul for LTE and NR.

The logical architecture of distributed RAN 200 may enable cooperationbetween and among TRPs 208, for example, within a TRP and/or across TRPsvia ANC 202. An inter-TRP interface may not be used.

Logical functions may be dynamically distributed in the logicalarchitecture of distributed RAN 200. As will be described in more detailwith reference to FIG. 5, the Radio Resource Control (RRC) layer, PacketData Convergence Protocol (PDCP) layer, Radio Link Control (RLC) layer,Medium Access Control (MAC) layer, and a Physical (PHY) layers may beadaptably placed at the DU (e.g., TRP 208) or CU (e.g., ANC 202).

FIG. 3 illustrates an example physical architecture of a distributed RAN300, according to aspects of the present disclosure. A centralized corenetwork unit (C-CU) 302 may host core network functions. C-CU 302 may becentrally deployed. C-CU 302 functionality may be offloaded (e.g., toadvanced wireless services (AWS)), in an effort to handle peak capacity.

A centralized RAN unit (C-RU) 304 may host one or more ANC functions.Optionally, The C-RU 304 may host core network functions locally. TheC-RU 304 may have distributed deployment. The C-RU 304 may be close tothe network edge.

A DU 306 may host one or more TRPs (edge node (EN), an edge unit (EU), aradio head (RH), a smart radio head (SRH), or the like). The DU may belocated at edges of the network with radio frequency (RF) functionality.

FIG. 4 illustrates example components of BS 110 and UE 120 (as depictedin FIG. 1), which may be used to implement aspects of the presentdisclosure. For example, antennas 452, processors 466, 458, 464, and/orcontroller/processor 480 of the UE 120 and/or antennas 434, processors420, 430, 438, and/or controller/processor 440 of the BS 110 may be usedto perform the various techniques and methods described herein for CRCconcatenated polar codes.

At the BS 110, a transmit processor 420 may receive data from a datasource 412 and control information from a controller/processor 440. Thecontrol information may be for the Physical Broadcast Channel (PBCH),Physical Control Format Indicator Channel (PCFICH), Physical Hybrid ARQIndicator Channel (PHICH), Physical Downlink Control Channel (PDCCH),group common PDCCH (GC PDCCH), etc. The data may be for the PhysicalDownlink Shared Channel (PDSCH), etc. The processor 420 may process(e.g., encode and symbol map) the data and control information to obtaindata symbols and control symbols, respectively. The processor 420 mayalso generate reference symbols, for the primary synchronization signal(PSS), secondary synchronization signal (SSS), and cell-specificreference signal (CRS). A transmit (TX) multiple-input multiple-output(MIMO) processor 430 may perform spatial processing (e.g., precoding) onthe data symbols, the control symbols, and/or the reference symbols, ifapplicable, and may provide output symbol streams to the modulators(MODs) 432 a through 432 t. Each modulator 432 may process a respectiveoutput symbol stream (e.g., for OFDM, etc.) to obtain an output samplestream. Each modulator may further process convert to analog, amplify,filter, and upconvert) the output sample stream to obtain a downlinksignal. Downlink signals from modulators 432 a through 432 t may betransmitted via the antennas 434 a through 434 t, respectively.

At the UE 120, the antennas 452 a through 452 r may receive the downlinksignals from the base station 110 and may provide received signals tothe demodulators (DEMODs) in transceivers 454 a through 454 r,respectively. Each demodulator 454 may condition (e.g., filter, amplify,downconvert, and digitize) a respective received signal to obtain inputsamples. Each demodulator may further process the input samples (e.g.,for OFDM, etc.) to obtain received symbols. A MIMO detector 456 mayobtain received symbols from all the demodulators 454 a through 454 r,perform MIMO detection on the received symbols if applicable, andprovide detected symbols. A receive processor 458 may processdemodulate, deinterleave, and decode) the detected symbols, providedecoded data for the UE 120 to a data sink 460, and provide decodedcontrol information to a controller/processor 480.

On the uplink, at UE 120, a transmit processor 464 may receive andprocess data (e.g., for the Physical Uplink Shared Channel (PUSCH)) froma data source 462 and control information for the Physical UplinkControl Channel (PUCCH) from the controller/processor 480. The transmitprocessor 464 may also generate reference symbols for a reference signal(e.g., for the sounding reference signal (SRS)). The symbols from thetransmit processor 464 may be precoded by a TX MIMO processor 466 ifapplicable, further processed by the demodulators in transceivers 454 athrough 454 r (e.g., for SC-FDM, etc.), and transmitted to the basestation 110. At the BS 110, the uplink signals from the UE 120 may bereceived by the antennas 434, processed by the modulators 432, detectedby a MIMO detector 436 if applicable, and further processed by a receiveprocessor 438 to obtain decoded data and control information sent by theUE 120. The receive processor 438 may provide the decoded data to a datasink 439 and the decoded control information to the controller/processor440.

The controllers/processors 440 and 480 may direct the operation at theBS 110 and the UE 120, respectively. The processor 440 and/or otherprocessors and modules at the BS 110 may perform or direct the executionof processes for the techniques described herein. The memories 442 and482 may store data and program codes for BS 110 and UE 120,respectively. A scheduler 444 may schedule UEs for data transmission onthe downlink and/or uplink.

FIG. 5 illustrates a diagram 500 showing examples for implementing acommunications protocol stack, according to aspects of the presentdisclosure. The illustrated communications protocol stacks may beimplemented by devices operating in a wireless communication system,such as a 5G system (e.g., a system that supports uplink-basedmobility). Diagram 500 illustrates a communications protocol stackincluding a RRC layer 510, a PDCP layer 515, a RLC layer 520, a MAClayer 525, and a PHY layer 530. In various examples, the layers of aprotocol stack may be implemented as separate modules of software,portions of a processor or ASIC, portions of non-collocated devicesconnected by a communications link, or various combinations thereof.Collocated and non-collocated implementations may be used, for example,in a protocol stack for a network access device (e.g., ANs, CUs, and/orDUs) or a UE.

A first option 505-a shows a split implementation of a protocol stack,in which implementation of the protocol stack is split between acentralized network access device (e.g., an ANC 202 in FIG. 2) anddistributed network access device (e.g., DU 208 in FIG. 2). In the firstoption 505-a, an RRC layer 510 and a PDCP layer 515 may be implementedby the central unit, and an RLC layer 520, a MAC layer 525, and a PRYlayer 530 may be implemented by the DU. In various examples the CU andthe DU may be collocated or non-collocated. The first option 505-a maybe useful in a macro cell, micro cell, or pico cell deployment.

A second option 505-h shows a unified implementation of a protocolstack, in which the protocol stack is implemented in a single networkaccess device. In the second option, RRC layer 510, PDCP layer 515, RLClayer 520, MAC layer 525, and PHY layer 530 may each be implemented bythe AN. The second option 505-b may be useful in, for example, a femtocell deployment.

Regardless of whether a network access device implements part or all ofa protocol stack, a UE may implement an entire protocol stack as shownin 505-c (e.g., the RRC layer 510, the PDCP layer 515, the RLC layer520, the MAC layer 525, and the PHY layer 530).

In LTE, the basic transmission time interval (TTI) or packet duration isthe 1 ms subframe. In NR, a subframe is still 1 ms, but the basic TTI isreferred to as a slot. A subframe contains a variable number of slots(e.g., 1, 2, 4, 8, 16, . . . slots) depending on the subcarrier spacing.The NR RB is 12 consecutive frequency subcarriers. NR may support a basesubcarrier spacing of 15 KHz and other subcarrier spacing may be definedwith respect to the base subcarrier spacing, for example, 30 kHz, 60kHz, 120 kHz, 240 kHz, etc. The symbol and slot lengths scale with thesubcarrier spacing. The CP length also depends on the subcarrierspacing.

FIG. 6 is a diagram showing an example of a frame format 600 for NR. Thetransmission timeline for each of the downlink and uplink may bepartitioned into units of radio frames. Each radio frame may have apredetermined duration (e.g., 10 ms) and may be partitioned into 10subframes, each of 1 ms, with indices of 0 through 9. Each subframe mayinclude a variable number of slots depending on the subcarrier spacing.Each slot may include a variable number of symbol periods (e.g., 7 or 14symbols) depending on the subcarrier spacing. The symbol periods in eachslot may be assigned indices. A mini-slot, which may be referred to as asub-slot structure, refers to a transmit tune Tat having a duration lessthan a slot (e.g., 2, 3, or 4 symbols).

Each symbol in a slot may indicate a link direction (e.g., DL, UL, orflexible) for data transmission and the link direction for each subframemay be dynamically switched. The link directions may be based on theslot format. Each slot may include DL/UI, data as well as DL/UL controlinformation.

In NR, a synchronization signal (SS) block is transmitted. The SS blockincludes a PSS, a SSS, and a two symbol PBCH. The SS block can betransmitted in a fixed slot location, such as the symbols 0-3 as shownin FIG. 6. The PSS and SSS may be used by UEs for cell search andacquisition. The PSS may provide half-frame timing, the SS may providethe CP length and frame timing. The PSS and SSS may provide the cellidentity. The PBCH carries some basic system information, such asdownlink system bandwidth, timing information within radio frame, SSburst set periodicity, system frame number, etc. The SS blocks may beorganized into SS bursts to support beam sweeping. Further systeminformation such as, remaining minimum system information (RMSI), systeminformation blocks (SIBs), other system information (OSI) can betransmitted on a physical downlink shared channel (PDSCH) in certainsubframes. The SS block can be transmitted up to sixty-four times, forexample, with up to sixty-four different beam directions for mmW. The upto sixty-four transmissions of the SS block are referred to as the SSburst set. SS blocks in an SS burst set are transmitted in the samefrequency region, while SS blocks in different SS bursts sets can betransmitted at different frequency locations.

In some circumstances, two or more subordinate entities (e.g., UEs) maycommunicate with each other using sidelink signals. Real-worldapplications of such sidelink communications tray include public safety,proximity services, UE-to-network relaying, vehicle-to-vehicle (V2V)communications, Internet of Everything (IoE) communications, IoTcommunications, mission-critical mesh, and/or various other suitableapplications. Generally, a sidelink signal may refer to a signalcommunicated from one subordinate entity (e.g., UE1) to anothersubordinate entity (e.g., UE2) without relaying that communicationthrough the scheduling entity (e.g., UE or BS), even though thescheduling entity may be utilized for scheduling and/or controlpurposes. In some examples, the sidelink signals may be communicatedusing a licensed spectrum (unlike wireless local area networks, whichtypically use an unlicensed spectrum).

A UE may operate in various radio resource configurations, including aconfiguration associated with transmitting pilots using a dedicated setof resources (e.g., a radio resource control (RRC) dedicated state,etc.) or a configuration associated with transmitting pilots using acommon set of resources (e.g., an RRC common state, etc.). Whenoperating in the RRC dedicated state, the UE may select a dedicated setof resources for transmitting a pilot signal to a network. Whenoperating in the RRC common state, the UE may select a common set ofresources for transmitting a pilot signal to the network. In eithercase, a pilot signal transmitted by the UE may be received by one ormore network access devices, such as an AN, or a DU, or portionsthereof. Each receiving network access device may be configured toreceive and measure pilot signals transmitted on the common set ofresources, and also receive and measure pilot signals transmitted ondedicated sets of resources allocated, to the UEs for which the networkaccess device is a member of a monitoring set of network access devicesfor the UE. One or more of the receiving network access devices, or a CUto which receiving network access device(s) transmit the measurements ofthe pilot signals, may use the measurements to identify serving cellsfor the UEs, or to initiate a change of serving cell for one or more ofthe UEs.

Example CRC Concatenated Polar Coding

FIG. 7 illustrates a portion of a radio frequency (RF) modem 704 thatmay be configured to provide an encoded message for wirelesstransmission (e.g., using CRC concatenated polar codes described below).In one example, an encoder in a transmitting device, such as a basestation (e.g., BS 110) on the downlink or a UE (e.g., UE 120) on theuplink, receives a message 702 for transmission. The message 702 maycontain data (e.g., information bits) and/or encoded voice or othercontent directed to the receiving device. The encoder 706 encodes themessage using a suitable modulation and coding scheme (MCS), typicallyselected based on a configuration defined by the BS 110 or anothernetwork entity. In some cases, the encoder 706 may be configured toencode the message 702 using techniques presented herein. The encodedbitstream 708 (e.g., representing to the encoded message 702) may thenbe provided to a mapper 710 that generates a sequence of Tx symbols 712that are modulated, amplified and otherwise processed by Tx chain 714 toproduce an RF signal 716 for transmission through antenna 718.

FIG. 8 illustrates a portion of a RF modem 810 that may be configured toreceive and decode a wirelessly transmitted signal including an encodedmessage (e.g., a message encoded using techniques presented herein). Invarious examples, the modem 810 receiving the signal may reside at thereceiving device, such as the UE 120 on the downlink or the BS 110 onthe uplink, or at any other suitable apparatus or means for carrying outthe described functions. An antenna 802 provides the RF signal 716 tothe receiving device. An Rx chain 806 processes and demodulates the RFsignal 716 and may provide a sequence of symbols 808 to a demapper 812,which produces a sequence of a-priori probabilities 814, oftenrepresented as log-likelihood ratios (LLRs) corresponding to the encodedmessage. A decoder 816 may then be used to decode m-bit informationstrings from a bitstream that has been encoded using a coding scheme(e.g., as described herein). The decoder 816 may comprise a CRCconcatenated polar decoder.

According to certain aspects, the encoder 706 may be a CRC concatenatedpolar encoder. As shown in FIG. 9, encoder 906 may include a CRC outercode encoder 906 a and polar inner code encoder 906 b. The encoder 906may receive the payload of K information bits to be transmitted and theCRC outer code encoder 906 a may add CRC bits and output K+r CRC encodedbits to the polar inner code encoder 906 b. The polar inner code encoder906 b uses polar code and produces N polar encoded bits. Similarly,decoder 1016 may include a polar decoder 1016 a and CRC decoder 1016 bas shown in FIG. 10.

Polar codes have been adopted for error-correction in NR systems. Polarcodes may be used to encode a stream of bits for transmission. Polarcodes are a capacity-achieving coding scheme with almost linear (inblock length) encoding and decoding complexity. Polar codes have manydesirable properties such as deterministic construction (e.g., based ona fast Hadamard transform), very low and predictable error floors, andsimple successive-cancellation (SC) based decoding.

Polar codes are linear block codes of length N=2^(n) where theirgenerator matrix G is constructed using the n^(th) Kronecker power ofthe kernel matrix

${G_{2} = \begin{bmatrix}1 & 0 \\1 & 1\end{bmatrix}},$denoted by G^(n). For example, Equation (1) shows the resultinggenerator n=2.

$\begin{matrix}{G^{\otimes 3} = {\begin{bmatrix}{G2} & 0 \\{G2} & {G2}\end{bmatrix} = \begin{bmatrix}1 & 0 & 0 & 0 \\1 & 1 & 0 & 0 \\1 & 0 & 1 & 0 \\1 & 1 & 1 & 1\end{bmatrix}}} & {{Eq}.\mspace{11mu}(1)}\end{matrix}$

Equation (2) shows the resulting generator matrix for n=3.

$\begin{matrix}{G^{\otimes 3} = {\begin{bmatrix}{G\; 2} & 0 & 0 & 0 \\{G\; 2} & {G\; 2} & 0 & 0 \\{G\; 2} & 0 & {G\; 2} & 0 \\{G\; 2} & {G\; 2} & {G\; 2} & {G\; 2}\end{bmatrix} = \begin{bmatrix}1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\1 & 1 & 0 & 0 & 1 & 1 & 0 & 0 \\1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 \\1 & 1 & 1 & 1 & 1 & 1 & 1 & 1\end{bmatrix}}} & {{Eq}.\mspace{11mu}(2)}\end{matrix}$

The encoder 706 can generate a codeword by using the generator matrix toencode a number of input bits consisting of K information bits and N-K“frozen” bits which contain no information and are “frozen” to a knownvalue, such as zero. For example, given a number of input bits u=(u₀,u₁, . . . , u_(n-1)), a resulting codeword vector x=(x₀, x₁, . . . ,x_(n-1)) may be generated by encoding the input bits using the generatormatrix G. Thus, x[1:N]=u[1:K]*G. This resulting codeword may then berate matched and transmitted by a base station over a wireless mediumand received by a UE. The frozen bits may be selected as the leastreliable bits (e.g., the rows with the lowest weight). In one example,referring to the matrix in Eq. (2), u=(0, 0, 0, u₃, 0 u₅, u₆, u₇) withu₀, u₁, u₂, and u₄ set as frozen bits. In this example:

$G = \begin{bmatrix}1 & 1 & 1 & 1 & 0 & 0 & 0 & 0 \\1 & 1 & 0 & 0 & 1 & 1 & 0 & 0 \\1 & 0 & 1 & 0 & 1 & 0 & 1 & 0 \\1 & 1 & 1 & 1 & 1 & 1 & 1 & 1\end{bmatrix}$

When the received vectors are decoded, for example by using a SuccessiveCancellation (SC) decoder (e.g., decoder 816), every estimated bit, hasa predetermined error probability given that bits û₀-û_(i−1) werecorrectly decoded, that, for extremely large code size N, tends towardseither 0 or 0.5. Moreover, the proportion of estimated bits with a lowerror probability tends towards the capacity of the underlying channel.Polar codes exploit this phenomenon, called channel polarization, byusing the most reliable K bits to transmit information, while setting toa predetermined value (such as 0), also referred to as freezing, theremaining (N-K) bits, for example as explained below.

Polar codes transform the channel into N parallel “virtual” channels forthe N information and frozen bits. If (is the capacity of the channel,then, for sufficiently large values of N, there are almost N*C channelswhich are extremely reliable and there are almost N(1−C) channels whichare extremely unreliable. The basic polar coding scheme then involvesfreezing (i.e., setting to a known value, such as zero) the input bitsin II corresponding to the unreliable channels, while placinginformation bits only in the bits of u corresponding to reliablechannels. For short-to-medium N, this polarization may not be completein the sense there could be several channels which are neithercompletely unreliable nor completely reliable (i.e., channels that aremarginally reliable). Depending on the rate of transmission, bitscorresponding to these marginally reliable channels may be either frozenor used for information bits.

In one example, a Polar decoder employs the successive cancellation (SC)or successive cancellation list (SCL) decoding algorithm. An SC decodingalgorithm essentially operates by performing a recursive depth-firsttraversal of a decoding tree, to convert the bitstream 814 (e.g., asequence of LLRs) into the message 818 corresponding to the message 702(e.g., when the decoding is successful).

As mentioned above, CRC concatenated polar coding may be performed,whereby the encoder 706 first performed CRC encoding on the Kinformation bits to produce K+r (information bits+checksums) CRC encodedbits and then polar encodes the K+r CRC encoded bits to produce N polarencoded bits. The CRC outer code encoder 1006 a uses generatorpolynomial for the CRC algorithm. In one example, an example generatorpolynomial x³+x²+1 can be represented as a binary row vector containingthe coefficients in descending orders of power, in this example, [1 1 01].

After the polar encoding, the first code bit x[1] is equal to themodulo-2 sum of all of the CRC output bits—regardless of the selectedinformation bit locations of the polar code.

Because CRC code is a cyclic code, a given CRC generator polynomialg(X)=X^(r)+ . . . +1, any n-length codeword can be expressed asu(X)=a(X)g(X), where a(X) is the message polynomial with maximum ordern-r. If the CRC generator polynomial is even weighted, then g(X=1)=0.Hence, u(X=1)=a(X)*0=0. Thus, when the CRC generator polynomial is evenweighted, the resulting CRC codeword is also even weighted. In thiscase, the first code bit x[1] (which may be the modulo-2 sum of the CRCencoded bits) in the cascaded polar output (the N polar encoded bits)always equals to a dummy bit (e.g., always a fixed value, such as “0”),which is independent the message (the K information bits input to theCRC encoder). Thus, the data rate of the encoder may be impacted.

Accordingly, techniques for CRC concatenated polar encoding aredesirable that avoid transmission of the dummy bits.

Example Methods and Apparatus for CRC Concatenated Polar Encoding

As noted above, polar codes are a relatively recent breakthrough incoding theory and have been proven to achieve Shannon capacity for largevalues of a code block size N, whereas for smaller code block sizes,polar codes may suffer from poor minimum distance. Techniques such assuccessive cancellation list (SCL) decoding, leverage a simple outercode having excellent minimum distance, such as a cyclic redundancycheck (CRC) or parity-check, on top of a polar inner code, such that thecombined code has excellent minimum distance. Although the addition ofCRC outer code improves the error-rate performance at low values of N,use of even-weighted CRC generator polynomials leads to additional dummybits in the polar output as discussed above. Transmission of dummy bitsmay reduce the efficiency, thereby reducing processing speed andefficiency, and increasing power consumption.

Thus, aspects of the present disclosure propose techniques for avoidingtransmission of dummy bits in CRC concatenated polar codes. For example,in some cases, only odd-weighted CRC generator polynomials may beselected. In some cases, when even-weighted CRC generator polynomialsare used, the dummy bit may be discarded, and/or bit-level scramblingcan be performed on the CRC bits to avoid generation of the dummy bit.Thereby, the encoding can achieve the benefits of minimum distance,while avoiding the transmission of dummy bits.

FIG. 11, FIG. 13, and FIG. 15 illustrate example operations 1100, 1300,and 1500, respectively, for encoding bits of information, for example,for CRC concatenated polar encoding that avoids transmission of dummybits, in accordance with certain aspects of the present disclosure.According to certain aspects, operations 1100, 1300, and/or 1500 may beperformed by any suitable encoding device, such as a base station (e.g.,a BS 110 in the wireless communication network 100) on the downlink or auser equipment (e.g., a UE 120 in the wireless communication network100) on the uplink.

The encoding device may include one or more components as illustrated inFIGS. 4, 7, 9, 12, 14, 16, and/or 18 which may be configured to performthe operations described herein. For example, the antenna 434,modulator/demodulator 432, transmit processor 420, controller/processor440, and/or memory 442 of the BS 110, as illustrated in FIG. 4, mayperform the operations described herein. Additionally or alternatively,the antenna 452, demodulator/modulator 454, transmit processor 464,controller/processor 480, and/or memory 482 of the UE 120, asillustrated in FIG. 4, may perform the operations described herein.Additionally or alternatively, the encoder 906, mapper 910, TX Chain914, and/or antenna 918 as illustrated in FIG. 9 may be configured toperform the operations described herein.

Although not shown, complementary operations to the operations 1100,1300, and 1500 may be performed for decoding bits of information. Thecomplementary operations may, for example, be performed by any suitabledecoding device, such as a BS (e.g., BS 110 in the wirelesscommunication network 100) on the uplink and/or a UE (e.g., UE 120 inthe wireless communication network 100) on the downlink. The decodingdevice may include one or more components as illustrated in FIGS. 4, 8,and 10 which may be configured to perform the operations describedherein. For example, the antenna 434, modulator/demodulator 432,transmit processor 420, controller/processor 440, and/or memory 442 ofthe BS 110, as illustrated in FIG. 4, may perform the operationsdescribed herein. Additionally or alternatively, the antenna. 452,demodulator/modulator 454, transmit processor 464, controller/processor480, and/or memory 482 of the UE 120, as illustrated in FIG. 4, mayperform the operations described herein. Additionally or alternatively,the decoder 1016, demapper 1012, RX Chain 1006, and/or antenna 1002 asillustrated in FIG. 10 may be configured to perform the complementaryoperations.

In one example, the first bit of the codeword may be discarded to avoidtransmission of the dummy bit, even when an even-weighted CRC polynomialis used for the CRC encoding. FIG. 11 illustrates example operations1100 for CRC concatenated polar encoding bits of information includingdiscarding a dummy bit, in accordance with certain aspects of thepresent disclosure. Operations 1100 begin, at 1102, by obtaining thebits of information to be transmitted.

At 1104, the encoder performs CRC outer encoding of the bits ofinformation using an even-weighted generator polynomial to produce CRCencoded bits.

At 1106, the encoder performs polar inner encoding of the CRC encodedbits to generate a codeword. The polar encoding may include setting oneor more most reliable bits as information bits and setting One or moreother bits as frozen bits.

At 1108, the encoder discards a first code bit (e.g., the x[1] bit) at abeginning of the codeword to produce a shortened codeword. The firstcode bit is equal to a modulo-2 sum of the CRC encoded bits. Foreven-weighted CRC generator polynomials, the first code bit may alwaysbe equal to a fixed bit value, such as a “0”. Thus, the first code bit(e.g., the x[1] bit) may be a dummy bit. Discarding the first code bitproduces the shortened codeword.

At 1110, the encoder transmits the shortened codeword in accordance witha radio technology (e.g., 5G) over a channel via one or more antennaelements situated proximate a transmitter. By discarding the dummy bit,the transmitting device avoids transmission of the dummy bit and mayimprove the efficiency of the transmission, while also achieving theimproved minimum distance of using CRC polar encoding.

As shown in FIG. 12, in some examples, the encoder 1206 may avoidtransmission of dummy bits may by discarding the x[1] bit of the Noutput polar encoded bits from the polar encoder. As mentioned above,when an even-weighted CRC generator polynomial is used, this bit isalways a bit-0, independent of the K message bits input to the CRCencoder. Thus, discarding this bit may avoid transmission of the dummybit.

In one example, the bit-level scrambling of the CRC encoded output canbe done before inputting to the polar encoder to avoid generation of thedummy bit. FIG. 13 illustrates example operations 1300 for CRCconcatenated polar encoding bits of information including performingbit-level scrambling of CRC encoded bits, in accordance with certainaspects of the present disclosure. Operations 1300 begin, at 1302, byobtaining the bits of information to be transmitted.

At 1304, the encoder performs CRC outer encoding of the bits ofinformation using an even-weighted generator polynomial to produce CRCencoded bits.

At 1306, the encoder performs bit scrambling of the CRC encoded bits.The bit scrambling may ensure that a first code bit (e.g., the x[1] codebit) at a beginning of the codeword is equal to a non-zero bit at leastsometimes.

At 1308, the encoder performs polar inner encoding of the scrambled CRCencoded bits to generate a codeword.

At 1310, the encoder transmits the codeword in accordance with a radiotechnology (e.g., 5G) over a channel via one or more antenna elementssituated proximate a transmitter. By scrambling the CRC encoded bits,the transmitting device avoids generation of the dummy bit and mayimprove the efficiency of the transmission, while also achieving theimproved minimum distance of using CRC polar encoding.

As shown in FIG. 14, in some examples, the encoder 1406 may avoidtransmission of dummy bits by using bit-level scrambling of the K+r CRCencoded bits output from the CRC encoder before they are input to thepolar encoder. As mentioned above, when an even-weighted CRC generatorpolynomial is used, the x[1] bit of the N output polar encoded bits isalways a bit-0, independent of the K message bits input to the CRCencoder. However, by scrambling the K+r CRC encoded bits output by theCRC encoder, at least some of the time this bit may be non-zero andtransmission of the dummy bit can be avoided. Although not shown, thescrambling may be performed by a bit scrambling module at the encoder906.

In one example, only odd-weighted CRC generator polynomials may beselected for the CRC encoding to avoid generation of the dummy bit. FIG.15 illustrates example operations 1500 for CRC concatenated polarencoding bits of information including selecting only odd-weighted CRCgenerator polynomials, in accordance with certain aspects of the presentdisclosure. Operations 1500 begin, at 1502, by obtaining the bits ofinformation to be transmitted.

At 1504, the encoder selects only odd-weighted generator polynomials forperforming CRC outer encoding of the bits of information to produce CRCencoded bits. The selection of only odd-weighted polynomials forperforming the CRC outer encoding may ensure that a first code bit[e.g., the x[1] code bit) at a beginning of the codeword is equal to anon-zero bit at least sometimes.

At 1506, the encoder performs polar inner encoding of the scrambled CRCencoded bits to generate a codeword.

At 1508, the encoder transmits the codeword in accordance with a radiotechnology (e.g., 5G) over a channel via one or more antenna elementssituated proximate a transmitter. By selecting only odd-weightedgenerator polynomials for the CRC encoding, the transmitting deviceavoids generation of the dummy bit and may improve the efficiency of thetransmission, while also achieving the improved minimum distance ofusing CRC polar encoding.

As shown in FIG. 16, in some examples, the encoder 1606 may avoidtransmission of dummy bits by selecting odd-weighted CRC generatorpolynomial for the CRC encoding. As mentioned above, when aneven-weighted CRC generator polynomial is used, the x[1] bit of the Noutput polar encoded bits is always a bit-0, independent of the Kmessage bits input to the CRC encoder. Thus, by selecting anodd-weighted CRC generator polynomial for the CRC encoder, this bit maybe non-zero and transmission of the dummy bit can be avoided.

FIG. 17 is an example graph illustrating encoding performance of variousCRC generator polynomials. Curve 1702 corresponds to the even-weightedCRC 3 polynomial g(x)=[1001] and curve 1704 corresponds to theodd-weighted CRC 3 polynomial g(x)=[1101]. As shown in the graph,performance for CRC concatenated polar codes using the even-weighted CRCgenerator polynomial (curve 1702) has worse performance than theodd-weighted (curve 1704). Avoiding transmission of dummy bits mayimprove block error rate (BLER).

FIG. 18 illustrates a communications device 1800 that may includevarious components (e.g., corresponding to means-plus-functioncomponents) configured to perform operations for the techniquesdisclosed herein, such as the operations 1100, 1300, and 1500illustrated in FIGS. 11, 13, and 15, respectively. The communicationsdevice 1800 includes a processing system 1802 coupled to a transceiver1808. The transceiver 1808 is configured to transmit and receive signalsfor the communications device 1800 via an antenna 1810, such as thevarious signals as described herein. The processing system 1802 may beconfigured to perform processing functions for the communications device1800, including processing signals received and/or to be transmitted bythe communications device 1800.

The processing system 1802 includes a processor 1804 coupled to acomputer-readable medium/memory 1812 via a bus 1806. In certain aspects,the computer-readable medium/memory 1812 is configured to storeinstructions (e.g., computer executable code) that when executed by theprocessor 1804, cause the processor 1804 to perform the operationsillustrated in FIGS. 11, 13, and 15, or other operations for performingthe various techniques discussed herein for avoiding transmission ofdummy bits in CRC polar encoding. In certain aspects, computer-readablemedium/memory 1812 stores code 1814 for obtaining information bits. Thecomputer readable medium/memory 1812 stores code 1816 for CRC outerencoding. The code 1816 for CRC outer encoding may include code forselecting the CRC-generator polynomial (e.g., for selecting onlyodd-weighted polynomials in some cases). The computer readablemedium/memory 1812 may store code 1818 for bit scrambling (e.g., if aneven-weighted polynomial is selected). The computer readablemedium/memory 1812 stores code 1820 for polar inner encoding. Thecomputer readable medium/memory 1812 may store code 1822 for discardinga first code bit (e.g., if an even-weighted polynomial is selected). Thecomputer readable medium/memory 1812 stores code 1824 for transmittingthe codeword.

In certain aspects, the processor 1804 has circuitry configured toimplement the code stored in the computer-readable medium/memory 1812.The processor 1804 includes encoder circuitry 1826. The encodercircuitry 1826 includes circuitry 1828 for obtaining information bits;circuitry 1830 for CRC outer encoding; and circuitry 1834 for polarinner encoding. The circuitry 1830 for CRC outer encoding may includecircuitry for generator polynomial selection (e.g., for selecting onlyodd-weighted polynomials in some cases). The encoder circuitry 1826 mayinclude circuitry 1832 for bit scrambling (e.g., if an even-weightedpolynomial is selected). The encoder circuitry 1826 may includecircuitry 1836 for discarding a first code bit (e.g., if aneven-weighted polynomial is selected).

It should be noted that the terms distributed, inserted, interleaved maybe used interchangeably and generally refer to the strategic placementof outer-code bits within an information stream inputted into anencoder, such as a Polar encoder. Additionally, it should be understoodthat, while aspects of the present disclosure propose techniques forreducing the search space of nodes in a polar decoding tree withrelation to wireless communication system, the techniques presentedherein are not limited to such wireless communication system. Forexample, the techniques presented herein may equally apply to any othersystem that uses encoding schemes, such as data storage or compression,or fiber communication systems, hard-wire “copper” communicationsystems, and the like.

As used herein, a phrase referring to “at least one of” a list of itemsrefers to any combination of those items, including single members. Asan example, “at least one of: a, h, or c” is intended to cover a, h, c,a-b, a-c, b-c, and a-b-c, as well as any combination with multiples ofthe same element (e.g., a-a, a-a-a, a-a-b, a-a-c, a-b-b, a-c-c, b-b,b-b-b, b-b-c, c-c, and c-c-c or any other ordering of a, b and c).

As used herein, the term “determining” encompasses a wide variety ofactions. For example, “determining” may include calculating, computing,processing, deriving, investigating, looking up (e.g., looking up in atable, a database or another data structure), ascertaining and the like.Also, “determining” may include receiving (e.g., receiving information),accessing (e.g., accessing data in a memory) and the like. Also,“determining” may include resolving, selecting, choosing, establishingand the like.

The previous description is provided to enable any person skilled in theart to practice the various aspects described herein. Variousmodifications to these aspects will be readily apparent to those skilledin the art, and the generic principles defined herein may be applied toother aspects. Thus, the claims are not intended to be limited to theaspects shown herein, but is to be accorded the full scope consistentwith the language of the claims, wherein reference to an element in thesingular is not intended to mean “one and only one” unless specificallyso stated, but rather “one or more.” Unless specifically statedotherwise, the term “some” refers to one or more. All structural andfunctional equivalents to the elements of the various aspects describedthroughout this disclosure that are known or later come to be known tothose of ordinary skill in the art are expressly incorporated herein byreference and are intended to be encompassed by the claims. Moreover,nothing disclosed herein is intended to be dedicated to the publicregardless of whether such disclosure is explicitly recited in theclaims. No claim element is to be construed under the provisions of 35U.S.C. § 112(f) unless the element is expressly recited using the phrase“means for” or, in the case of a method claim, the element is recitedusing the phrase “step for.”

The various operations of methods described above may be performed byany suitable means capable of performing the corresponding functions.The means may include various hardware and/or software component(s)and/or module(s), including, but not limited to a circuit, anapplication specific integrated circuit (ASIC), or processor. Generally,where there are operations illustrated in figures, those operations mayhave corresponding counterpart means-plus-function components withsimilar numbering.

The various illustrative logical blocks, modules and circuits describedin connection with the present disclosure may be implemented orperformed with a general purpose processor, a digital signal processor(DSP), an application specific integrated circuit (ASIC), a fieldprogrammable gate array (FPGA) or other programmable logic device (PLD),discrete gate or transistor logic, discrete hardware components, or anycombination thereof designed to perform the functions described herein.A general-purpose processor may be a microprocessor, but in thealternative, the processor may be any commercially available processor,controller, microcontroller, or state machine. A processor may also beimplemented as a combination of computing devices, e.g., a combinationof a DSP and a microprocessor, a plurality of microprocessors, one ormore microprocessors in conjunction with a DSP core, or any other suchconfiguration.

If implemented in hardware, an example hardware configuration maycomprise a processing system in a wireless node. The processing systemmay be implemented with a bus architecture. The bus may include anynumber of interconnecting buses and bridges depending on the specificapplication of the processing system and the overall design constraints.The bus may link together various circuits including a processor,machine-readable media, and a bus interface. The bus interface may beused to connect a network adapter, among other things, to the processingsystem via the bus. The network adapter may be used to implement thesignal processing functions of the PHY layer. In the case of a userterminal 120 (see FIG. 1), a user interface (e.g., keypad, display,mouse, joystick, etc.) may also be connected to the bus. The bus mayalso link various other circuits such as timing sources, peripherals,voltage regulators, power management circuits, and the like, which arewell known in the art, and therefore, will not be described any further.The processor may be implemented with one or more general-purpose and/orspecial-purpose processors. Examples include microprocessors,microcontrollers, DSP processors, and other circuitry that can executesoftware. Those skilled in the art will recognize how best to implementthe described functionality for the processing system depending on theparticular application and the overall design constraints imposed on theoverall system.

If implemented in software, the functions may be stored or transmittedover as one or more instructions or code on a computer readable medium.Software shall be construed broadly to mean instructions, data, or anycombination thereof, whether referred to as software, firmware,middleware, microcode, hardware description language, or otherwise.Computer-readable media include both computer storage media andcommunication media including any medium that facilitates transfer of acomputer program from one place to another. The processor may beresponsible for managing the bus and general processing, including theexecution of software modules stored on the machine-readable storagemedia. A computer-readable storage medium may be coupled to a processorsuch that the processor can read information from, and write informationto, the storage medium. In the alternative, the storage medium may beintegral to the processor. By way of example, the machine-readable mediamay include a transmission line, a carrier wave modulated by data,and/or a computer readable storage medium with instructions storedthereon separate from the wireless node, all of which may be accessed bythe processor through the bus interface. Alternatively, or in addition,the machine-readable media, or any portion thereof, may be integratedinto the processor, such as the case may be with cache and/or generalregister files. Examples of machine-readable storage media may include,by way of example, RAM (Random Access Memory), flash memory, ROM (ReadOnly Memory), PROM (Programmable Read-Only Memory), EPROM (ErasableProgrammable Read-Only Memory), EEPROM (Electrically ErasableProgrammable Read-Only Memory), registers, magnetic disks, opticaldisks, hard drives, or any other suitable storage medium, or anycombination thereof. The machine-readable media may be embodied in acomputer-program product.

A software module may comprise a single instruction, or manyinstructions, and may be distributed over several different codesegments, among different programs, and across multiple storage media.The computer-readable media may comprise a number of software modules.The software modules include instructions that, when executed by anapparatus such as a processor, cause the processing system to performvarious functions. The software modules may include a transmissionmodule and a receiving module. Each software module may reside in asingle storage device or be distributed across multiple storage devices.By way of example, a software module may be loaded into RAM from a harddrive when a triggering event occurs. During execution of the softwaremodule, the processor may load some of the instructions into cache toincrease access speed. One or more cache lines may then be loaded into ageneral register file for execution by the processor. When referring tothe functionality of a software module below, it will be understood thatsuch functionality is implemented by the processor when executinginstructions from that software module.

Also, any connection is properly termed a computer-readable medium. Forexample, if the software is transmitted from a website, server, or otherremote source using a coaxial cable, fiber optic cable, twisted pair,digital subscriber line (DSL), or wireless technologies such as infrared(IR), radio, and microwave, then the coaxial cable, fiber optic cable,twisted pair, DSL, or wireless technologies such as infrared, radio, andmicrowave are included in the definition of medium. Disk and disc, asused herein, include compact disc (CD), laser disc, optical disc,digital versatile disc (DVD), floppy disk, and Blu-ray® disc where disksusually reproduce data magnetically, while discs reproduce dataoptically with lasers. Thus, in some aspects computer-readable media maycomprise non-transitory computer-readable media (e.g., tangible media).In addition, for other aspects computer-readable media may comprisetransitory computer-readable media (e.g., a signal). Combinations of theabove should also be included within the scope of computer-readablemedia.

Thus, certain aspects may comprise a computer program product forperforming the operations presented herein. For example, such a computerprogram product may comprise a computer-readable medium havinginstructions stored (and/or encoded) thereon, the instructions beingexecutable by one or more processors to perform the operations describedherein. For example, instructions for performing the operationsdescribed herein and illustrated in FIG. 11, FIG. 13, and FIG. 15.

Further, it should be appreciated that modules and/or other appropriatemeans for performing the methods and techniques described herein can bedownloaded and/or otherwise obtained by a user terminal and/or basestation as applicable. For example, such a device can be coupled to aserver to facilitate the transfer of means for performing the methodsdescribed herein. Alternatively, various methods described herein can beprovided via storage means (e.g., RAM, ROM, a physical storage mediumsuch as a compact disc (CD) or floppy disk, etc.), such that a userterminal and/or base station can obtain the various methods uponcoupling or providing the storage means to the device. Moreover, anyother suitable technique for providing the methods and techniquesdescribed herein to a device can be utilized.

It is to be understood that the claims are not limited to the preciseconfiguration and components illustrated above. Various modifications,changes and variations may be made in the arrangement, operation anddetails of the methods and apparatus described above without departingfrom the scope of the claims.

The invention claimed is:
 1. An apparatus for wireless communications,comprising: at least one processor coupled with a memory and comprisingat least one encoder circuit configured to: obtain bits of informationto be transmitted; perform cyclic redundancy check (CRC) outer encodingof the bits of information using an even-weighted generator polynomialto produce CRC encoded bits; perform polar inner encoding of the CRCencoded bits to generate a codeword; and discard a first code bit at abeginning of the codeword to produce a shortened codeword, wherein thediscarding the first code bit is based on use of the even-weightedgenerator polynomial; and a transmitter configured to transmit theshortened codeword in accordance with a wireless technology across achannel via one or more antenna elements situated proximate thetransmitter.
 2. The apparatus of claim 1, wherein the first code bit isequal to a modulo-2 sum of the CRC encoded bits.
 3. The apparatus ofclaim 2, wherein the first code bit comprises a dummy bit.
 4. Theapparatus of claim 1, wherein the performing polar inner encodingincludes: setting one or more most reliable bits as information bits;and setting one or more other bits as frozen bits.
 5. An apparatus forwireless communications, comprising: at least one processor coupled witha memory and comprising at least one encoder circuit configured to:obtain bits of information to be transmitted; perform cyclic redundancycheck (CRC) outer encoding of the bits of information using aneven-weighted generator polynomial to produce CRC encoded bits; performbit scrambling of the bits of information and the CRC encoded bits,wherein the performing bit scrambling is based on use of theeven-weighted generator polynomial; and perform polar inner encoding ofthe scrambled bits of information and CRC encoded bits to generate acodeword; and a transmitter configured to transmit the codeword inaccordance with a wireless technology across a channel via one or moreantenna elements situated proximate the transmitter.
 6. The apparatus ofclaim 5, wherein a first code bit at a beginning of the codeword isequal to a non-zero bit.
 7. The apparatus of claim 5, wherein theperforming polar inner encoding includes: setting one or more mostreliable bits as information bits; and setting one or more other bits asfrozen bits.
 8. An apparatus for wireless communications, comprising: atleast one processor coupled with a memory and comprising at least oneencoder circuit configured to: obtain bits of information to betransmitted; select only odd-weighted generator polynomials forperforming cyclic redundancy check (CRC) outer encoding of the bits ofinformation to produce CRC encoded bits; perform polar inner encoding ofthe CRC encoded bits to generate a codeword; and a transmitterconfigured to transmit the codeword in accordance with a wirelesstechnology across a channel via one or more antenna elements situatedproximate the transmitter.
 9. A method of encoding bits of information,comprising: obtaining the bits of information to be transmitted;performing cyclic redundancy check (CRC) outer encoding of the bits ofinformation using an even-weighted generator polynomial to produce CRCencoded bits; performing polar inner encoding of the CRC encoded bits togenerate a codeword; discarding a first code bit at a beginning of thecodeword to produce a shortened codeword, wherein the discarding thefirst code bit is based on use of the even-weighted generatorpolynomial; and transmitting the shortened codeword in accordance with awireless technology across a channel via one or more antenna elementssituated proximate a transmitter.
 10. The method of claim 9, wherein thefirst code bit is equal to a modulo-2 sum of the CRC encoded bits. 11.The method of claim 10, wherein the first code bit comprises a dummybit.
 12. The method of claim 9, wherein the performing polar innerencoding includes: setting one or more most reliable bits as informationbits; and setting one or more other bits as frozen bits.
 13. A method ofencoding bits of information, comprising: obtaining the bits ofinformation to be transmitted; performing cyclic redundancy check (CRC)outer encoding of the bits of information using an even-weightedgenerator polynomial to produce CRC encoded bits; performing bitscrambling of the bits of information and the CRC encoded bits, whereinthe performing bit scrambling is based on use of the even-weightedgenerator polynomial; performing polar inner encoding of the scrambledbits of information and CRC encoded bits to generate a codeword; andtransmitting the codeword in accordance with a wireless technologyacross a channel via one or more antenna elements situated proximate atransmitter.
 14. The method of claim 13, wherein a first code bit at abeginning of the codeword is equal to a non-zero bit.
 15. The method ofclaim 13, wherein the performing polar inner encoding includes: settingone or more most reliable bits as information bits; and setting one ormore other bits as frozen bits.
 16. A method of encoding bits ofinformation, comprising: obtaining the bits of information to betransmitted; selecting only odd-weighted generator polynomials forperforming cyclic redundancy check (CRC) outer encoding of the bits ofinformation to produce CRC encoded bits; performing polar inner encodingof the CRC encoded bits to generate a codeword; and transmitting thecodeword in accordance with a wireless technology across a channel viaone or more antenna elements situated proximate a transmitter.